Modified Frank–Wolfe algorithm for enhanced sparsity in support vector machine classifiers
نویسندگان
چکیده
منابع مشابه
Modified Frank-Wolfe Algorithm for Enhanced Sparsity in Support Vector Machine Classifiers
This work proposes a new algorithm for training a reweighted `2 Support Vector Machine (SVM), inspired on the re-weighted Lasso algorithm of Candès et al. and on the equivalence between Lasso and SVM shown recently by Jaggi. In particular, the margin required for each training vector is set independently, defining a new weighted SVM model. These weights are selected to be binary, and they are a...
متن کاملSupport Vector Machine Classifiers for Asymmetric Proximities
The aim of this paper is to afford classification tasks on asymmetric kernel matrices using Support Vector Machines (SVMs). Ordinary theory for SVMs requires to work with symmetric proximity matrices. In this work we examine the performance of several symmetrization methods in classification tasks. In addition we propose a new method that specifically takes classification labels into account to...
متن کاملKnowledge-Based Support Vector Machine Classifiers
Prior knowledge in the form of multiple polyhedral sets, each belonging to one of two categories, is introduced into a reformulation of a linear support vector machine classifier. The resulting formulation leads to a linear program that can be solved efficiently. Real world examples, from DNA sequencing and breast cancer prognosis, demonstrate the effectiveness of the proposed method. Numerical...
متن کاملSparse least squares Support Vector Machine classifiers
In least squares support vector machine (LS-SVM) classi-ers the original SVM formulation of Vapnik is modiied by considering equalit y constraints within a form of ridge regression instead of inequality constraints. As a result the solution follows from solving a set of linear equations instead of a quadratic programming problem. Ho wever, a d r a wback is that sparseness is lost in the LS-SVM ...
متن کاملA dynamic model selection strategy for support vector machine classifiers
The Support Vector Machine (SVM) is a very powerful technique for general pattern recognition purposes but its efficiency in practice relies on the optimal selection of hyper-parameters. A naïve or ad hoc choice of values for these can lead to poor performance in terms of generalization error and high complexity of the parameterized models obtained in terms of the number of support vectors iden...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2018
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2018.08.049